Duality in graphs and logical topology survivability in layered networks
نویسنده
چکیده
Graphs provide natural and convenient representations of communication networks. Graph models and flow formulations have been extensively used in the study of a large number of issues relating to network analysis and design. Structural characteristics such as connectivity/fault survivability (a measure of robustness of networks when link or node failures occur) and diameter (a measure of delay incurred in transmission of information from one node to another) have served as parameters in the design of communication networks. There is a rich body of literature dealing with these and related issues.
منابع مشابه
Cross Layer Network Survivability in Cross-layer Metrices and Shortest Path Identification Usig Aco
In layered networks, a single failure at a lower layer may cause multiple failures in the upper layers. As a result, traditional schemes that protect against single failures may not be effective in cross-layer networks. A cross layer network with logical and physical topologies, the survivable logical topology routing problem is to route each link in the logical layer with a path in the physica...
متن کاملPreserving Survivability During Logical Topology Reconfiguration in WDM Ring Networks
We consider the design of reconfiguring logical topologies over physical WDM ring networks. The logical topology consists of the same set of nodes as the physical topology, and the links of the logical topology are lightpaths established (or embedded) over the physical topology. The logical topology is said survivable if the failure of any single physical link does not disconnect the logical to...
متن کاملOptimal Coding Subgraph Selection under Survivability Constraint
Nowadays communication networks have become an essential and inevitable part of human life. Hence, there is an ever-increasing need for expanding bandwidth, decreasing delay and data transfer costs. These needs necessitate the efficient use of network facilities. Network coding is a new paradigm that allows the intermediate nodes in a network to create new packets by combining the packets recei...
متن کاملA generalization of the Chen-Wu duality into quantale-valued setting
With the unit interval [0,1] as the truth value table, Chen and Wupresented the concept of possibility computation over dcpos.Indeed, every possibility computation can be considered as a[0,1]-valued Scott open set on a dcpo. The aim of this paper is tostudy Chen-Wu's duality on quantale-valued setting. For clarity,with a commutative unital quantale $L$ as the truth value table, weintroduce a c...
متن کاملLogical topology design for linear and ring optical networks
The design of logical topologies in wavelength-routing multihop optical networks is a well-studied problem. In this paper, we consider logical topology (LT) design over the popular ring and linear topologies. Our objective is the minimization of the electronic processing delay for the worst case traffic flow. For uniform traffic between nodes, this delay minimization corresponds to minimizing t...
متن کامل